Context%2DAware Recommender Systems.
Context has rarely been incorporated into recommender systems so far, but physical (e.g. a user’s location) or social (e.g. the social network of a user) context can be useful sources for improving recommender systems. In this paper, we first discuss some principles for context-awareness in recommender systems. Then we present our hybrid recommender system for recommending applications to users of mobile devices. Finally, we describe our approach to utilize social networks to enhance collaborative filtering. Our evaluation shows that the social recommender outperforms traditional collaborative filtering algorithms in our scenario. 1.
An energy%2Defficient mobile recommender system.

Context%2Dawareness in recommender systems research workshop and movie recommendation challenge.

Proceedings of the 2009 ACM Conference on Recommender Systems

Experimental comparison of pre%2D vs. post%2Dfiltering approaches in context%2Daware recommender systems.

Improving rating estimation in recommender systems using aggregation%2D and variance%2Dbased hierarchical models.

Improving rating estimation in recommender systems using aggregation%2D and variance%2Dbased hierarchical models.

Improving Personalization Solutions through Optimal Segmentation of Customer Bases.

Dynamic micro%2Dtargeting fitness%2Dbased approach to predicting individual preferences.

Preface to the special issue on data mining for personalization.

Improving Collaborative Filtering Recommendations Using External Data.

Social networks looking ahead.



The Effect of Context on the Predictive Performance of Segmentation.

Managing large collections of data mining models.

Using Context to Improve Predictive Modeling of Customers in Personalization Applications.

User Profiling with Hierarchical Context An e%2DRetailer Case Study.

Dynamic Micro Targeting Fitness%2DBased Approach to Predicting Individual Preferences.

Leveraging aggregate ratings for better recommendations.

Validation Sequence Optimization A Theoretical Approach.

Mining Actionable Patterns by Role Models.
Data mining promises to discover valid and potentially useful patterns in data. Often, discovered patterns are not useful to the user. ”Actionability ” addresses this problem in that a pattern is deemed actionable if the user can act upon it in her favor. We introduce the notion of “action ” as a domain-independent way to model the domain knowledge. Given a data set about actionable features and an utility measure, a pattern is actionable if it summarizes a population that can be acted upon towards a more promising population observed with a higher utility. We present several pruning strategies taking into account the actionability requirement to reduce the search space, and algorithms for mining all actionable patterns as well as mining the top k actionable patterns. We evaluate the usefulness of patterns and the focus of search on a real-world application domain.
Personalization in Context Does Context Matter When Building Personalized Customer Models%3F

Improving Personalization Solutions through Optimal Segmentation of Customer Bases.

Segmenting Customers from Population to Individuals Does 1%2Dto%2D1 Keep Your Customers Forever%3F

On Characterization and Discovery of Minimal Unexpected Patterns in Rule Discovery.

Personalization technologies A process%2Doriented perspective.

Mining Patterns That Respond to Actions.

Incorporating contextual information in recommender systems using a multidimensional approach.
The paper presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical information on users and items used in most of the current recommender systems. This approach supports multiple dimensions, extensive profiling, and hierarchical aggregation of recommendations. The paper also presents a multidimensional rating estimation method capable of selecting two-dimensional segments of ratings pertinent to the recommendation context and applying standard collaborative filtering or other traditional two-dimensional rating estimation techniques to these segments. A comparison of the multidimensional and two-dimensional rating estimation approaches is made, and the tradeoffs between the two are studied. Moreover, the paper introduces a combined rating estimation method that identifies the situations where the MD approach outperforms the standard two-dimensional approach and uses the MD approach in those situations and the standard two-dimensional approach elsewhere. Finally, the paper presents a pilot empirical study of the combined approach, using a multidimensional movie recommender system that was developed for implementing this approach and testing its performance. 1 1.
Personalization technologies a process%2Doriented perspective.

Toward the Next Generation of Recommender Systems A Survey of the State%2Dof%2Dthe%2DArt and Possible Extensions.
This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches. This paper also describes various limitations of current recommendation methods and discusses possible extensions that can improve recommendation capabilities and make recommender systems applicable to an even broader range of applications. These extensions include, among others, an improvement of understanding of users and items, incorporation of the contextual information into the recommendation process, support for multcriteria ratings, and a provision of more flexible and less intrusive types of recommendations. 
Divide and Prosper Comparing Models of Customer Behavior From Populations to Individuals.
This paper compares customer segmentation, 1-to-1, and aggregate marketing approaches across a broad range of experimental settings, including multiple segmentation levels, marketing datasets, dependent variables, and different types of classifiers, segmentation techniques, and predictive measures. Our experimental results show that, overall, 1-to-1 modeling significantly outperforms the aggregate approach among high-volume customers and is never worse than aggregate approach among low-volume customers. Moreover, the best segmentation techniques tend to outperform 1-to-1 modeling among low-volume customers. 1.
On the discovery of significant statistical quantitative rules.

From the Guest Co%2DEditors.

On the Use of Optimization for Data Mining Theoretical Interactions and eCRM Opportunities.

Handling very large numbers of association rules in the analysis of microarray data.
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for the analysis of such data. In this paper, we propose to use association rule discovery methods for determining associations among expression levels of different genes. One of the main problems related to the discovery of these associations is the scalability issue. Microarrays usually contain very large numbers of genes that are sometimes measured in 10,000s. Therefore, analysis of  such data can generate a very large number of associations that can often be measured in millions. The paper addresses this problem by presenting a method that enables biologists to evaluate these very large numbers of discovered association rules during the post-analysis stage of the data mining process. This is achieved by providing several rule evaluation operators, including rule grouping, filtering, browsing, and data inspection operators, that allow biologists to validate multiple individual gene regulation patterns at a time. By iteratively applying these operators, biologists can explore a significant part of all the initially generated rules in an acceptable period of time and thus answer biological questions that are of a particular interest to him or her. To validate our method, we tested our system on the microarray data pertaining to the studies of environmental hazards and their influence of gene expression processes. As a result, we managed to answer several questions that were of interest to the biologists that had collected this data.
Querying multiple sets of discovered rules.
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a small subset of them is really useful in applications. Although there exist some systems allowing the user to query the discovered rules, they are less suitable for complex ad hoc querying of multiple data mining rulebases to retrieve interesting rules. In this paper, we propose a new powerful rule query language Rule-QL for querying multiple rulebases that is modeled after SQL and has rigorous theoretical foundations of a rule-based calculus. In particular, we first propose a rule-based calculus RC based on the first-order logic, and then present the language Rule-QL that is at least as expressive as the safe fragment of RC. We also propose a number of efficient query evaluation techniques for Rule-QL and test them experimentally on some representative queries to demonstrate the feasibility of Rule-QL.
Knowledge refinement based on the discovery of unexpected patterns in data mining.

An Architecture of e%2DButler A Consumer%2DCentric Online Personalization System.

Multidimensional Recommender Systems A Data Warehousing Approach.

Expert%2DDriven Validation of Rule%2DBased User Models in Personalization Applications.

Using Data Mining Methods to Build Customer Profiles.


Small is beautiful discovering the minimal set of unexpected patterns.
A drawback of most traditional data mining methods is that they do not leverage prior knowledge of users. In many business settings, managers and analysts have significant intuition based on several years of experience. In prior work [11, 12] we proposed methods that could discover unexpected patterns in data by using this domain knowledge in a systematic manner. In this paper we continue our focus on discovering unexpected patterns and propose new methods for discovering a minimal set of unexpected patterns that discover orders of magnitude fewer patterns and yet retain most of the truly interesting ones. We demonstrate the strengths of this approach experimentally using a case study application in a marketing domain.  1. INTRODUCTION  A well-known criticism of many rule discovery algorithms in data mining is that they generate too many patterns, many of which are obvious or irrelevant. It stands to reason that more effective  methods are needed to discover fewer and more relevant pat...
Report on the KDD2000 Panel Personalization and Data Mining Exploring the Synergies.


A Belief%2DDriven Method for Discovering Unexpected Patterns.
Several pattern discovery methods proposed in the data  mining literature have the drawbacks that they discover  too many obvious or irrelevant patterns and that they do  not leverage to a full extent valuable prior domain  knowledge that decision makers have. In this paper we  propose a new method of discovery that addresses these  drawbacks. In particular we propose a new method of  discovering unexpected patterns that takes into  consideration prior background knowledge of decision  makers. This prior knowledge constitutes a set of  expectations or beliefs about the problem domain. Our  proposed method of discovering unexpected patterns uses  these beliefs to seed the search for patterns in data that  contradict the beliefs. To evaluate the practicality of our  approach, we applied our algorithm to consumer purchase  data from a major market research company and to web  logfile data tracked at an academic Web site and present  our findings in the paper.  
A Pattern Discovery Algebra.

Discovery of Actionable Patterns in Databases The Action Hierarchy Approach.
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a tree of actions with patterns and pat-tern templates (data mining queries) assigned to its nodes. A method for discovering actionable patterns is presented and various techniques for optimizing the discovery process are proposed.
Discovering Unexpected Patterns in Temporal Data Using Temporal Logic.

Pattern Discovery in Temporal Databases A Temporal Logic Approach.
The work of Mannila et al. [4] of finding frequent  episodes in sequences is extended to finding temporal  logic patterns in temporal databases. It is argued that  temporal logic provides an appropriate formalism for  expressing temporal patterns defined over categorical  data. It is also proposed to use Temporal Logic  Programming as a mechanism for the discovery of  frequent patterns expressible in temporal logic. It is  explained in the paper how frequent temporal patterns  can be discovered by constructing temporal logic  programs. To test these methods , temporal logic  programs were constructed for certain classes of patterns  and were implemented in OPS5.  Introduction  In this paper, we address the problem of finding interesting patterns in temporal databases [1,2] defined over categorical (symbolic) data. This is an important problem that frequently occurs in various applications such as molecular biology (finding patterns in genetic sequences), telecommunications (finding pat...
Modeling Data%2DIntensive Reactive Systems with Relational Transition Systems.

What Makes Patterns Interesting in Knowledge Discovery Systems.
One of the central problems in the eld of knowledge discovery is the development ofgood measures of interestingness of discovered patterns. Such measures of interestingness are divided into objective measures -- those that depend only on the structure of a pattern and the underlying data used in the discovery process, and the subjective measures -- those that also depend on the class of users who examine the pattern. The focus of this paper is on studying subjective measures of interestingness. These measures are classified into actionable and unexpected, and the relationship between them is examined. The unexpected measure of interestingness is defined in terms of the belief system that the user has. Interestingness of a pattern is expressed in terms of how it affects the belief system. The paper also discusses how this unexpected measure of interestingness can be used in the discovery process.  
On Data Representation and Use in a Temporal Relational DBMS.

Recent Advances in Temporal Databases

On Subjective Measures of Interestingness in Knowledge Discovery.

On Temporal Grouping
Spatio-temporal segmentation of video sequences attempts to extract backgrounds and independent objects in the dynamic scenes captured in the sequences. It is an essential step of video analysis. It has important applications in video coding, video logging, indexing and retrieval, and more generally in scene interpretation and video understanding. We classify spatio-temporal grouping techniques into three categories: (1) segmentation with spatial priority, (2) segmentation by trajectory grouping, and (3) joint spatial and temporal segmentation. The first category is the broadest, as it inherits the legacy techniques of image segmentation and motion segmentation. The other two categories place a higher priority on the accumulation of evidence along the temporal dimension and are more recent developments made feasible by the increased availability of computing power. For each category we provide a taxonomy of the techniques used to produce meaningful pixel groupings.
Templar A Knowledge%2DBased Language for Software Specifications Using Temporal Logic.

Extending Temporal Logic to Support High%2DLevel Simulations.

On Periodicity in Temporal Databases.
The issue of periodicity is generally understood to be a desirable property of tem-poral data that should be supported by temporal database models and their query languages. Nevertheless, there has so far not been any systematic examination of how to incorporate this concept into a temporal DBMS. In this paper we describe two con-cepts of periodicity, which we call strong periodicity and near periodicity, and discuss how they capture formally two of the intuitive meanings of this term. We formally compare the expressive power of these two concepts, relate them to existing tempo-ral query languages, and show how they can be incorporated into temporal relational database query languages, such as the proposed temporal extension to SQL, in a clean and straightforward manner. Periodicity is a feature of temporal phenomena that has received relatively little attention in the literature of temporal databases. The work that has been done related to periodicity, which we survey in Section 1.1, has been either mostly of a theoretical nature or is related to
On Completeness of Historical Relational Query Languages.

On the Completeness of Query Languages for Grouped and Ungrouped Historical Data Models.

Applications of temporal Databases to Knowledge%2Dbased Simulations.

Querying Datalog Programs with Temporal Logic.

Abstract%2DDriven Pattern Discovery in Databases.
New York University* In this paper, we study the problem of discovering interesting patterns in large volumes of data. Patterns can be expressed in user-defined terms and not only in terms of the database schema. The user-defined terminology is stored in a data dictionary that maps it into the language of the database schema. We define a pattern as a deductive rule expressed in user-defined terms that has a degree of certainty associated with it. We present methods of discovering interesting patterns based on abstracts which are summaries of the data expressed in the language of the user. 1
A Temporal Relational Algebra as Basis for Temporal Relational Completeness.

Querying and Controlling the Future Behaviour of Complex Objects.

Relational Database Behavior Utilizing Relational Discrete Event Systems and Models.

A Semantic Approach to Correctness of Concurrent Transaction Executions.

